a new method to determine a well-dispersed subsets of non-dominated vectors for momilp ‎problem

نویسندگان

g. tohidi

sh. razavian

چکیده

multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. the optimality of such optimizations is largely defined through the pareto optimality. multiple objective integer linear programs (moilp) are special cases of multiple criteria decision making problems. numerous algorithms have been designed to solve moilp and multiple objective mixed integer linear programs. however, moilp have not received the algorithmic attention that continuous problems have. this paper uses the data envelopment analysis (dea) technique to find a well-dispersed non-dominated vectors of multiple objective mixed integer linear programming (momilp) problem with bounded or unbounded feasible region, while the previous methods consider only problems with bounded feasible region. to this end, it uses the l$_1-$norm and the modified slack-based measure (msbm) model. the proposed method does not need the filtering procedures and it ranks the elements of well-dispersed non-dominated vectors of momilp problem. the proposed algorithm is illustrated by using two numerical ‎examples.‎

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP ‎problem

Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...

متن کامل

A new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP problem

Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially in conflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desi...

متن کامل

Well-dispersed subsets of non-dominated solutions for MOMILP ‎problem

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

A MODIFIED METHOD TO DETERMINE A WELL-DISPERSED SUBSET OF NON-DOMINATED VECTORS OF AN MOMILP PROBLEM

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

متن کامل

well-dispersed subsets of non-dominated solutions for momilp ‎problem

this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

a modified method to determine a well-dispersed subset of non-dominated vectors of an momilp problem

this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of industrial mathematics

ناشر: science and research branch, islamic azad university, tehran, iran

ISSN 2008-5621

دوره 7

شماره 1 2015

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023